Computational Complexity and New Computing Approaches

Optical Computing and Computational Complexity

This work concerns the computational complexity of a model of computation that is inspired by optical computers. The model is called the continuous space machine and operates in discrete timesteps over a number of two-dimensional images of fixed size and arbitrary spatial resolution. The (constant time) operations on images include Fourier transformation, multiplication, addition, thresholding,...

Computational Complexity Reduction in Eigenspace Approaches

Computational complexity of schema matching approaches

Comparing and integrating of different data structures e.g. relational databases of information systems is a current problem in information sciences. Various solutions have appeared in the last 10 years aimed to achieve a high accuracy level in schema integration and similarity measurement of entities originating from different schemas. The capabilities of approaches are usually properly evalua...

A Computational Complexity Theory in Membrane Computing

In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture within the framework of a bio-inspired and non-conve...

Computational Complexity Aspects in Membrane Computing

Within the framework of membrane systems, distributed parallel computing models inspired by the functioning of the living cell, various computational complexity classes have been defined, which can be compared against the computational complexity classes defined for Turing machines. Here some issues and results concerning computational complexity of membrane systems are discussed. In particular...